氧化铝熟料单筒冷却机节能技术改造

本对影响氧化铝熟料单筒冷却机冷却效率的因素进行了分析，并提出了相应的节能技术改造措施，取得了明显的节能效益。     

带限信号高频重建的一种新的正则外推算法

本文提出生种新的带限信号的外推方法，该方法能够很好地抑制噪声干扰，且计算复杂性较低，本文给出算法，证明了收敛性，最后给出了误差计算机实验结果。     

最大熵重建的迭代凸I投影算法

本文探讨了用迭代凸Ｉ投影（ＩｔｅｒａｔｉｖｅＣｏｎｖｅｘＩ－Ｐｒｏｊｅｃｔｉｏｎ，ＩＣＩＰ）算法求解最大熵Ｘ－ＣＴ重建问题．其思路是将这个复杂问题转化为多个简单子问题，然后迭代地求解这种单约束子问题．理论证明，这种算法收敛并能收敛到问题的最大熵解．这种算法形式优美，仿真结果表明算法同时也是有效的．     

Edge detection,three-dimensional cell boundary reconstruction and volume and surface area estimation from differential interference contrast images

Three-dimensional (3-D) cell morphology is important for the understanding of cell function and can by quantified in terms of volume and surface area. Differential interference contrast (DIC, or Nomarski) imaging can enable cell edges to be clearly visualized in unstained tissue due to the slight difference in refractive index between aqueous media and cytoplasm. DIC is affected in only one direction - the direction of the optical shear. A 1-D edge detector was used in that direction with a scale length equal to that of an in-focus edge to highlight cell boundaries. By comparison with the signal from the edge detector on an out-of-focus slice, the in-focus slices could be segmented and, after noise suppression, cell outlines obtained. A voxel paradigm was used to calculate cell volume and differential geometry was used for surface area estimation. We applied this approach to obtain 3-D dimensional information by optical sectioning of motile Amoeba proteus.     

A generalized approach to the reconstruction of a restricted class of digitized planar curves

Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised. The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding problem for a class of curves.     

多项式正交滤波器与共轭正交滤波器组

主要讨论了多项式正交滤波器和共轭正交滤波器组的构造方法，首先利用Riesz引理和特殊的余弦三角形多项式，给出了一种多项式正交滤波器的构造算法，该算法可以构造出一系列特性各异的紧支撑正交小波基；还给出了由一个矩阵CQFs派生多个新的矩阵CQFs的共轭正交滤波器组算法,包括由低阶矩阵CQFs构造高阶矩阵CQFs。     

扇形束投影域重建—再投影迭代法

本文所提出的投影域重建——再投影迭代算法可以恢复不完整的扇形束投影数据,从而实现从有限的投影数据重建图象。这种算法把滤波——反投影图象重建过程和再投影的过程纳入一个公式,仅在投影域上估算未知的投影数据,因此避免了重建过程和反投影过程中的插值运算,改善了收敛性,提高了计算精度,缩短了运算时间。模拟实验表明:即使有70％的投影数据丢失,经过两次迭代就能以令人满意的精度恢复丢失的投影数据。     

旧貌换新颜 --漫谈东方花园酒店的改造设计

结合实例，探讨把老办公楼改造为五星级涉外宾馆的过程中遇到的问题及其解决方法。     

A geometry-based error estimation for cross-ratios

For choosing specific cross-ratios as 2D projective coordinates in various computer vision applications, a reasonable error analysis model is usually required. This investigation adopts the assumption of normal distribution for positioning errors of point features in an image to formulate the error variances of cross-ratios. Based on a geometry-based error analysis, a straightforward way of identifying the cross-ratios with minimum error variances is proposed. Simulation results show that the proposed approach, as well as a further simplified alternative, yield much better estimations of minimum error variances in terms of accuracy, cost, and stability compared with some other methods, e.g., the one based on the rule given by Georis et al. (IEEE Trans. Pattern Anal. Mach. Intell. 20 (4) (1998) 366). Some causes of the performance differences in the estimations are explained using a special configuration of point features.     

A tolerant approach to reconstruct topology from unorganized trimmed surfaces

Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges.